Exact lower bound for proportion of maximally embedded beamlet
نویسندگان
چکیده
منابع مشابه
Exact lower bound for proportion of maximally embedded beamlet
We prove that the maximal inscribed beamlet is at least 1/7 of an arbitrary line segment (i.e., beam). The implication of this result is addressed.
متن کاملExact quantum lower bound for grover's problem
One of the most important quantum algorithms ever discovered is Grover’s algorithm for searching an unordered set. We give a new lower bound in the query model which proves that Grover’s algorithm is exactly optimal. Similar to existing methods for proving lower bounds, we bound the amount of information we can gain from a single oracle query, but we bound this information in terms of angles. T...
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملThe lower bound for the number of 1-factors in generalized Petersen graphs
In this paper, we investigate the number of 1-factors of a generalized Petersen graph $P(N,k)$ and get a lower bound for the number of 1-factors of $P(N,k)$ as $k$ is odd, which shows that the number of 1-factors of $P(N,k)$ is exponential in this case and confirms a conjecture due to Lovász and Plummer (Ann. New York Acad. Sci. 576(2006), no. 1, 389-398).
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2005
ISSN: 0893-9659
DOI: 10.1016/j.aml.2004.08.007